Lattice-Ordered Matrix Algebras Over Real GCD-Domains
نویسندگان
چکیده
منابع مشابه
A Proof of Weinberg’s Conjecture on Lattice-ordered Matrix Algebras
Let F be a subfield of the field of real numbers and let Fn (n ≥ 2) be the n× n matrix algebra over F. It is shown that if Fn is a lattice-ordered algebra over F in which the identity matrix 1 is positive, then Fn is isomorphic to the lattice-ordered algebra Fn with the usual lattice order. In particular, Weinberg’s conjecture is true. Let L be a totally ordered field, and let Ln (n ≥ 2) be the...
متن کاملSemi-linear Varieties of Lattice-Ordered Algebras
We consider varieties of pointed lattice-ordered algebras satisfying a restricted distributivity condition and admitting a very weak implication. Examples of these varieties are ubiquitous in algebraic logic: integral or distributive residuated lattices; their {·}-free subreducts; their expansions (hence, in particular, Boolean algebras with operators and modal algebras); and varieties arising ...
متن کاملRoughness in Lattice Ordered Effect Algebras
Many authors have studied roughness on various algebraic systems. In this paper, we consider a lattice ordered effect algebra and discuss its roughness in this context. Moreover, we introduce the notions of the interior and the closure of a subset and give some of their properties in effect algebras. Finally, we use a Riesz ideal induced congruence and define a function e(a, b) in a lattice ord...
متن کاملFinite homogeneous and lattice ordered effect algebras
Effect algebras (or D-posets) have recently been introduced by Foulis and Bennett in [1] for study of foundations of quantum mechanics. (See also [2], [3].) The prototype effect algebra is (E(H),⊕, 0, I), where H is a Hilbert space and E(H) consists of all self-adjoint operators A of H such that 0 ≤ A ≤ I. For A,B ∈ E(H), A⊕B is defined iff A+B ≤ 1 and then A⊕B = A+B. E(H) plays an important ro...
متن کاملApproximate Polynomial GCD over Integers with Digits-wise Lattice
For the given coprime polynomials over integers, we change their coefficients slightly over integers so that they have a greatest common divisor (GCD) over integers. That is an approximate polynomial GCD over integers. There are only two algorithms known for this problem. One is based on an algorithm for approximate integer GCDs. The other is based on the well-known subresultant mapping and the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Communications in Algebra
سال: 2013
ISSN: 0092-7872,1532-4125
DOI: 10.1080/00927872.2011.654299